Termination w.r.t. Q of the following Term Rewriting System could be proven:
Q restricted rewrite system:
The TRS R consists of the following rules:
+(a, b) → +(b, a)
+(a, +(b, z)) → +(b, +(a, z))
+(+(x, y), z) → +(x, +(y, z))
f(a, y) → a
f(b, y) → b
f(+(x, y), z) → +(f(x, z), f(y, z))
Q is empty.
↳ QTRS
↳ DirectTerminationProof
Q restricted rewrite system:
The TRS R consists of the following rules:
+(a, b) → +(b, a)
+(a, +(b, z)) → +(b, +(a, z))
+(+(x, y), z) → +(x, +(y, z))
f(a, y) → a
f(b, y) → b
f(+(x, y), z) → +(f(x, z), f(y, z))
Q is empty.
We use [23] with the following order to prove termination.
Recursive path order with status [2].
Quasi-Precedence:
a > b
f2 > +2
Status: +2: [1,2]